By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 11, Issue 4, pp. 859-1146

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On the Convergence of Grid-Based Methods for Unconstrained Optimization

I. D. Coope and C. J. Price

pp. 859-869

A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization

E. de Klerk, J. Peng, C. Roos, and T. Terlaky

pp. 870-888

Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems

Michael Ulbrich

pp. 889-917

Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints

Stefan Scholtes

pp. 918-936

Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems

Elijah Polak, Liqun Qi, and Defeng Sun

pp. 937-961

Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application

Yun-Bin Zhao and Duan Li

pp. 962-973

Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming

Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, and Philippe L. Toint

pp. 974-1002

The Set of Divergent Descent Methods in a Banach Space is \boldmath$\sigma$\unboldmath-Porous

Simeon Reich and Alexander J. Zaslavski

pp. 1003-1018

FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver

Qun Chen and Michael C. Ferris

pp. 1019-1036

Limiting Average Criteria For Nonstationary Markov Decision Processes

Xianping Guo and Peng Shi

pp. 1037-1053

On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems

Dong-Hui Li and Masao Fukushima

pp. 1054-1064

An Alternative Method to Crossing Minimization on Hierarchical Graphs

Petra Mutzel

pp. 1065-1080

Approximate Max-Min Resource Sharing for Structured Concave Optimization

M. D. Grigoriadis, L. G. Khachiyan, L. Porkolab, and J. Villavicencio

pp. 1081-1091

A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

Craig T. Lawrence and André L. Tits

pp. 1092-1118

A Nonlinear Lagrangian Approach to Constrained Optimization Problems

X. Q. Yang and X. X. Huang

pp. 1119-1144

Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods

Liqun Qi and Zengxin Wei

pp. 1145-1146